Transfer matrix in counting problems
نویسندگان
چکیده
The transfer matrix is a powerful technique that can be applied to statistical mechanics systems as, for example, in the calculus of entropy ice model. One interesting way study such map it onto three-color problem. In this paper, we explicitly build problem order calculate number possible configurations finite with free, periodic one direction and toroidal boundary conditions (periodic both directions)
منابع مشابه
The Umbral Transfer-Matrix Method, III: Counting Animals
This is the third part of the five-part saga on the umbral transfermatrix method, based on Gian-Carlo Rota’s seminal notion of the umbra. In this article we describe the Maple package ZOO that for any specific k, automatically constructs an umbral scheme for enumerating “k-board” lattice animals (polyominoes) on the two-dimensional square lattice. Such umbral schemes enable counting these impor...
متن کاملCounting Problems in Apollonian Packings
An Apollonian circle packing is a classical construction which is made by repeatedly inscribing circles into the triangular interstices in a Descartes configuration of four mutually tangent circles. Remarkably, if the original four circles have integer curvature, all of the circles in the packing will have integer curvature, making the packings of interest from a number theoretic point of view....
متن کاملCounting Problems in Moduli Space
Recall that Ωn = SL(n,R)/SL(n,Z) is the space of covolume 1 lattices in R. This space is non-compact, since we can have arbitrarily short vectors in a lattice. We will refer to moduli spaces of translation surfaces as defined in the lectures by Howard Masur in this volume [Ma1, Definition 6] as strata. Note that the case of n = 2 in the space of lattices and the case of the stratum H1(∅) boil d...
متن کاملDifferential Transfer Matrix Solution of Generalized Eigenvalue Problems
Abstract. We report a new analytical method for solution of a wide class of second-order differential equations with eigenvalues replaced by arbitrary functions. This approach is based on the extension of the previously reported differential transfer matrix method with modified basis functions. Applications of the method to boundary value and initial value problems, as well as several examples ...
متن کاملCounting Constraint Satisfaction Problems
This chapter surveys counting Constraint Satisfaction Problems (counting CSPs, or #CSPs) and their computational complexity. It aims to provide an introduction to the main concepts and techniques, and present a representative selection of results and open problems. It does not cover holants, which are the subject of a separate chapter. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics C
سال: 2021
ISSN: ['0129-1831', '1793-6586']
DOI: https://doi.org/10.1142/s0129183122500322